On modified Chebyshev polynomials
نویسندگان
چکیده
منابع مشابه
On integer Chebyshev polynomials
We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...
متن کاملOn Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...
متن کاملSurface Description for Cornea Topography Using Modified Chebyshev-polynomials
The optical behaviour of the (human) cornea is often characterized with the Zernike-coefficients derived via the Zernike-transform of its optical power map. In this paper, a radial transform based on the Chebyshev-polynomials of the second kind is suggested for a surface-based, rather than an optical power map based representation of the cornea. This transform is well-suited for providing compa...
متن کاملSymmetrized Chebyshev Polynomials
We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves alternate) result that their coefficients are non-negative. As a corollary we find that Tn(c cos θ) and Un(c cos θ) are positive definite functions. We further s...
متن کاملBlind Signature Scheme Based on Chebyshev Polynomials
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete loga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2006
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2005.12.020